Decidability of structural equivalence of E0L grammars
نویسندگان
چکیده
منابع مشابه
Decidability of Bisimulation Equivalence for First-Order Grammars
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Sénizergues’ decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for language equivalence of deterministic pushdown automata.
متن کاملSimulation of Scattered Context Grammars and Phrase-Structured Grammars by Symbiotic E0L Grammars
This paper contains more examples to formerly introduced concept of formal language equivalency. That is, for two models, there is a substitution by which we change each string of every yield sequence in one model so that sequence ofs string resulting from this change represents a yield sequence in the other equvalent model, these two models closely simulates each other; otherwise they do not. ...
متن کاملDecidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all instantiations of its variables by strings? Our proof uses the notations developed in the causal approach to concurrency. As a byproduct we obtain decidability of similar equivalence for other formalisms. In particula...
متن کاملDecidability of DPDA equivalence
A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90176-3